منابع مشابه
The power of non-ground rules in Answer Set Programming
Answer set programming (ASP) is a well-established logic programming language that offers an intuitive, declarative syntax for problem solving. In its traditional application, a fixed ASP program for a given problem is designed and the actual instance of the problem is fed into the program as a set of facts This approach typically results in programs with comparably short and simple rules Howev...
متن کاملSp-3143 Updating Some Ground Rules for Man-machine Simulation
Laboratory gaming and simulation continue to be used as research and training tools of great value In many fields of social and organizational behavior. Discriminating researchers are aware, hovever, of the many fundamental problems that limit the valid applications of simulation studies. Laboratory simulation Inevitably creates a problem of Interpretation, I.e., of Inferring correspondence bet...
متن کاملOn the Complexity of Extending Ground Resolution with Symmetry Rules
One important issue of automated theorem proving is the complexity of the inference rules used in theorem provers. If Krishnamurty's general symmetry rule is to be used, then one should provide some way of computing non trivial symmetries. We show that this problem is NP-complete. But this general rule can be simplified by restricting it to what we call 5symmetries, yielding the well-known symm...
متن کاملPreprocessing of Complex Non-Ground Rules in Answer Set Programming
In this paper we present a novel method for preprocessing complex non-ground rules in answer set programming (ASP). Using a well-known result from the area of conjunctive query evaluation, we apply hypertree decomposition to ASP rules in order to make the structure of rules more explicit to grounders. In particular, the decomposition of rules reduces the number of variables per rule, while on t...
متن کاملTermination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules
We show that termination is decidable for rewrite systems that contain shallow and right-linear rules, collapsing rules, and rightground rules. This class of rewrite systems is expressive enough to include interesting rules. Our proof uses the fact that this class of rewrite systems is known to be regularity-preserving and hence the reachability and joinability problems are decidable. Decidabil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1997
ISSN: 0028-0836,1476-4687
DOI: 10.1038/385385d0